Abstract
Number theory is one of the core branches of pure mathematics. It has played an important role in the study of natural numbers. In this paper, we are presenting a theorem on the numbers of form 10X, where x ε z+. The proposed theorem have a major application in computer science. It can be used to predict ‘n’ bits which will always represent more than 10X total numbers. We proved that the nature of the ‘n’ bits is always one of the forms 10i, 10i + 4, or 10i + 7, where i ε W.
Keywords: Number theory, Binary Number System, Modular Arithmetic, 10X
